Visibility Preprocessing Using Spherical Sampling of Polygonal Patches

نویسنده

  • Oscar E. Meruvia Pastor
چکیده

A technique is presented that permits fast view-reconstruction of individual objects. This method improves a previous approach to solve the problem of approximated view reconstruction by combining clustering of polygons with visibility bitfields to determine visibility for novel viewpoints. The technique consists of three steps: patch creation, spherical sampling, and rendering. In the first stage, the input 3D model is tiled in polygonal patches. In the sampling stage images of the model are taken from several points on the surface of a viewing sphere. Patch-ID bitfields, which are structures that contain visibility information, are computed for each picture. In the rendering stage, a subset of the viewpoints computed for sampling is selected depending on the viewers position on the viewing sphere and the bitfields of the selected viewpoints are used to rebuild the visible parts of the model from the new viewpoint. The overall system presented here makes a very efficient use of memory resources, and involves practically no overhead during rendering while significantly improving frame rate during interaction with large models. Although the technique is not conservative, our results show that the reconstructed views are practically identical to the original views of the model.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Visibility maintenance of a moving segment observer inside polygons with holes

We analyze how to efficiently maintain and update the visibility polygons for a segment observer moving in a polygonal domain. The space and time requirements for preprocessing are O(n) and after preprocessing, visibility change events for weak and strong visibility can be handled in O(log |VP|) and O(log(|VP1| + |VP2|)) respectively, or O(log n) in which |VP| is the size of the line segment’s ...

متن کامل

Improving the Construction of the Visibility–Voronoi Diagram

Ron Wein et al. [4] introduced the Visibility-Voronoi diagram for clearance c, denoted by V V , which is a hybrid between the visibility graph and the Voronoi diagram of polygons in the plane. It evolves from the visibility graph to the Voronoi diagram as the parameter c grows from 0 to ∞. This diagram can be used for planning natural-looking paths for a robot translating amidst polygonal obsta...

متن کامل

Visibility Preprocessing for Complex 3d Scenes Using Hardware-visibility Queries

In cases of densely occluded urban scenes, it is effective to determine the visibility of scenes, since only small parts of the scene are visible from a given cell. In this paper, we introduce a new visibility preprocessing method that efficiently computes potentially visible objects for volumetric cells. The proposed method deals with general 3D polygonal models and invisible objects jointly b...

متن کامل

Visibility Silhouettes for Semi-Analytic Spherical Integration

At each shade point, the spherical visibility function encodes occlusion from surrounding geometry, in all directions. Computing this function is difficult and point-sampling approaches, such as ray-tracing or hardware shadow mapping, are traditionally used to efficiently approximate it. We propose a semi-analytic solution to the problem where the spherical silhouette of the visibility is compu...

متن کامل

Weak visibility queries of line segments in simple polygons and polygonal domains

In this paper we consider the problem of computing the weak visibility polygon of any query line segment pq (or WVP(pq)) inside a given polygon P . Our first non-trivial algorithm runs in simple polygons and needs O(n log n) time and O(n) space in the preprocessing phase to report WVP(pq) of any query line segment pq in time O(log n + |WVP(pq)|). We also give an algorithm to compute the weak vi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002